Distance measures based on the edit distance for permutation-type representations
نویسنده
چکیده
In this paper, we develop and discuss several distance measures for permutation type representations of solutions of combinatorial optimisation problems. The problems discussed include single-machine and multiple-machine scheduling problems, the travelling salesman problem, vehicle routing problems, and many others. The distance measures are based on the edit distance. We introduce several extensions to the simple edit distance for more complex problem representations and show how each of these can be calculated.
منابع مشابه
Profiling the Distance Characteristics of Mutation Operators for Permutation-Based Genetic Algorithms
In this paper, we consider the permutation representation of genetic algorithms, and more generally, local search algorithms. We use a variety of permutation distance measures to profile the behavior of the most commonly used mutation operators for permutation-based genetic algorithms. Our operator profiles are also applicable to other local search algorithms, such as simulated annealing, as th...
متن کاملA Linear Formulation of the Graph Edit Distance for Graph Recognition
An efficient graph matching algorithm based on optimizing the graph edit distance is presented. The graph edit distance is expressed as a linear function of a permutation matrix and a sequence of edit matrices which represent graph edit operations. This allows the development of a linear program that is solved using an interior point method. The linear optimization produces a continuous analog ...
متن کاملUsing the Implication/Realization Model for Measuring Melodic Similarity
The concept of melodic similarity has become increasingly relevant in the light of music retrieval and music content processing systems. We propose a new way of measuring melodic similarity, based on analyses of the melody according to the Implication/Realization (I/R) model [7] for melodic structure and cognition. The similarity is assessed as the edit-distance between these I/R analyses. We p...
متن کاملHereditary properties of permutations are strongly testable
We show that for every hereditary permutation property P and every ε0 > 0, there exists an integer M such that if a permutation π is ε0far from P in the Kendall’s tau distance, then a random subpermutation of π of order M has the property P with probability at most ε0. This settles an open problem whether hereditary permutation properties are strongly testable, i.e., testable with respect to th...
متن کاملTransformation Rules for Knowledge-Based Pattern Matching
Many AI tasks require determining whether two knowledge representations encode the same knowledge. For example, rule-based classification requires matching rule antecedents with working memory; information retrieval requires matching queries with documents; and some knowledge-acquisition tasks require matching new information with already encoded knowledge to expand upon and debug both of them....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Heuristics
دوره 13 شماره
صفحات -
تاریخ انتشار 2007